<?xml version='1.0' encoding="utf-8"?>
      <rss version='2.0'>
      <channel>
      <title>Форум на Исходниках.RU</title>
      <link>https://forum.sources.ru</link>
      <description>Форум на Исходниках.RU</description>
      <generator>Форум на Исходниках.RU</generator>
  	
      <item>
        <guid isPermaLink='true'>https://forum.sources.ru/index.php?showtopic=414662&amp;view=findpost&amp;p=3797123</guid>
        <pubDate>Fri, 26 Apr 2019 15:14:51 +0000</pubDate>
        <title>Podkotovka K ekszamenam</title>
        <link>https://forum.sources.ru/index.php?showtopic=414662&amp;view=findpost&amp;p=3797123</link>
        <description><![CDATA[Dream2019: 2 of 41. (a) Обеспечить реализацию частично связанного списка в Java стека, показывая вовлеченные структуры данных и интерфейс класса. Вы можете опустить определения методов стека. (8marks) <br>
(b) С помощью диаграмм-указателей покажите как операция pop () работает со стеком, реализация которого связана со списком. Рассматривать случаи стека с одним значением и стека с более чем одним значением. Есть ли разница? (7 баллов) &copy; Дайте Java-реализацию метода pop (). Какова сложность pop () в нотации big-Oh?<br>
<br>
Q1,Q2,Q3<br>
<span class="b-attach" data-size="83456" data-hits="409" data-attach-id="60460" data-attach-post-id="3797123">
			<span class="b-attach__title"></span><a class='b-attach-link' href='https://forum.sources.ru/index.php?act=Attach&amp;type=post&amp;id=3797123&amp;attach_id=60460' title='Скачать файл' target='_blank'>public_int_pop.doc</a> (, : 409)
		</span>]]></description>
        <author>Dream2019</author>
        <category>Java</category>
      </item>
	
      <item>
        <guid isPermaLink='true'>https://forum.sources.ru/index.php?showtopic=414662&amp;view=findpost&amp;p=3796771</guid>
        <pubDate>Mon, 22 Apr 2019 09:27:23 +0000</pubDate>
        <title>Podkotovka K ekszamenam</title>
        <link>https://forum.sources.ru/index.php?showtopic=414662&amp;view=findpost&amp;p=3796771</link>
        <description><![CDATA[Dream2019: Two hour exam<br>
Attempt three out of four questions <br>
all questions carry equal marks <br>
one complementary mark for paper.<br>
<br>
100%<br>
<br>
StackTest.java<br>
<br>
2017<br>
1,2,3Q 21%<br>
<br>
<div class='tag-code'><span class='pre_code'></span><div class='code  code_collapsed ' title='Подсветка синтаксиса доступна зарегистрированным участникам Форума.' style=''><div><div><ol type="1"><div class="code_line">// StackTest.java</div><div class="code_line">// Linked list implementation of Stack</div><div class="code_line">&nbsp;</div><div class="code_line">&nbsp;class StackException extends Exception { </div><div class="code_line">&nbsp;&nbsp; &nbsp;public StackException(String s) {</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;super(s);</div><div class="code_line">&nbsp;&nbsp; &nbsp;}</div><div class="code_line">}</div><div class="code_line">&nbsp;</div><div class="code_line">class Stack {</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; </div><div class="code_line">&nbsp;&nbsp; &nbsp;class Node {</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;int data;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;Node next; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;}</div><div class="code_line">&nbsp;&nbsp; &nbsp;private Node top;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;public Stack()</div><div class="code_line">&nbsp;&nbsp; &nbsp;{ </div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;top = null;</div><div class="code_line">&nbsp;&nbsp; &nbsp;}</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;public void push(int x) {</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;Node &nbsp;t = new Node();</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;t.data = x;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;t.next = top;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;top = t;</div><div class="code_line">&nbsp;&nbsp; &nbsp;}</div><div class="code_line">&nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;// only to be called if list is non-empty.</div><div class="code_line">&nbsp;&nbsp; &nbsp;// Otherwise an exception should be thrown.</div><div class="code_line">&nbsp;&nbsp; &nbsp;public int pop() throws StackException</div><div class="code_line">&nbsp;&nbsp; &nbsp;{</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;if(this.isEmpty()) </div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;throw new StackException(&quot;\nIllegal to pop() an empty Stack\n&quot;);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;int x = top.data;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;top = top.next;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;return x; &nbsp; &nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;}</div><div class="code_line">&nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;public boolean isEmpty(){</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; return top == null;</div><div class="code_line">&nbsp;&nbsp; &nbsp;}</div><div class="code_line">&nbsp;</div><div class="code_line">&nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;public int size() {</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;int c = 0;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;Node t = top;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;while(t != null) {</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;++c;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;t = t.next;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;}</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;return c; &nbsp; &nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;}</div><div class="code_line">&nbsp;&nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp;public void display() {</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;Node t = top;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;//Console.Write(&quot;\nStack contents are: &nbsp;&quot;);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;System.out.println(&quot;\nStack contents are: &nbsp;&quot;);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;while (t != null) { &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;System.out.print(t.data + &quot; &quot;);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;t = t.next;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;} &nbsp; &nbsp; &nbsp; </div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;System.out.println(&quot;\n&quot;);</div><div class="code_line">&nbsp;&nbsp; &nbsp;}</div><div class="code_line">&nbsp;</div><div class="code_line">}</div><div class="code_line">&nbsp;</div><div class="code_line">&nbsp;</div><div class="code_line">public class StackTest</div><div class="code_line">{</div><div class="code_line">&nbsp;&nbsp; &nbsp;public static void main( String[] arg){</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;Stack s = new Stack();</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;System.out.println(&quot;Stack is created\n&quot;);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;// piece of code to test our exception mechanism</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;try {</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;s.pop();</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;} catch (StackException e) {</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;System.out.println(&quot;Exception thrown: &quot; + e);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;}</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;s.push(10); s.push(3); s.push(11); s.push(7);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;s.display();</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;System.out.println(&quot;Stack sixe is &quot; + s.size());</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; </div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; /* int i = s.pop();</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;System.out.println(&quot;Just popped &quot; + i);</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;s.display();</div><div class="code_line">&nbsp;&nbsp; &nbsp; &nbsp; &nbsp;*/</div><div class="code_line">&nbsp;&nbsp; &nbsp;}</div><div class="code_line">}</div></ol></div></div></div></div><script>preloadCodeButtons('1');</script>]]></description>
        <author>Dream2019</author>
        <category>Java</category>
      </item>
	
      </channel>
      </rss>
	