Recent content by SuperSusanoo

  1. SuperSusanoo

    Question about JAL instruction in datapath

    Homework Statement In this problem, you will modify the single-cycle datapath we built up in class to implement JAL instruction. The MIPS jump and link instruction, JAL, is used to support procedure calls by jumping to jump address (similar to j ) and saving the address of the following...
  2. SuperSusanoo

    Question about multi-threading in computer architecture

    Homework Statement I don't quiet understand the concept of multi-threading in computer architecture. What I understand so far is that with multi-threading, instructions can be executed in a pipe-line without dependencies as long as they are not on the same thread. This doesn't make sense to me...
  3. SuperSusanoo

    Schools Frustrated computer science student

    Hello people, I am currently a computer science student and I think that what I am doing is not making any sense. Everyday I wake up and go to a class that doesn't make any sense to me. I study just to pass a foolish exam. That's not learning. That's not life. The reason why I chose computer...
  4. SuperSusanoo

    Question about input of scanners in flex

    Homework Statement I have the following set of definitions CHARCON ('([^\\'\n]|\\[\\'"0nt])') BAD_CHARCON ('([^\\'\n]|\\[\\'"0nt]|\\[^\\'"0nt])?[']?[\n]?) My questions are what is a charcon?, why does it have such weird characters and why are the characters of BAD_STRINGCON bad...
  5. SuperSusanoo

    What Is a Scanner in Compiler Design?

    Homework Statement I am totally lost with this assignment. I don't even know what to study in order to do it. I posted a file with the main feature of the assignment, so I am just wondering if you can orient me little bit. Any advise would be useful First of all, what is a scanner and how does...
  6. SuperSusanoo

    Which Addressing Modes Minimize Instructions?

    Homework Statement We covered the following addressing modes in class: • Absolute • Register indirect • Based (base + displacement) • Scale indexed (base + index × constant) • Memory indirect • Auto increment/decrement (by 1 byte) Consider the following high-level programs: (1) int a = 0...
  7. SuperSusanoo

    Proof about symmetric groups and generators

    Homework Statement Let n>=2 n is natural and set x=(1,2,3,...,n) and y=(1,2). Show that Sym(n)=<x,y> Homework EquationsThe Attempt at a Solution Approach: Induction Proof: Base case n=2 x=(1,2) y=(1,2) Sym(2)={Id,(1,2)} (1,2)=x and Id=xy so base case holds Inductive step assume...